A note on the ultimate categorical matching in a graphHSU, Lih-Hsing.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 487-488, issn 0012-365XArticle

The spanning connectivity of line graphsHUANG, Po-Yi; HSU, Lih-Hsing.Applied mathematics letters. 2011, Vol 24, Num 9, pp 1614-1617, issn 0893-9659, 4 p.Article

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphsKAO, Shin-Shin; HSU, Lih-Hsing.Applied mathematics and computation. 2005, Vol 160, Num 1, pp 269-282, issn 0096-3003, 14 p.Article

Brother trees: A family of optimal 1_p-hamiltonian and 1-edge hamiltonian graphsKAO, Shin-Shin; HSU, Lih-Hsing.Information processing letters. 2003, Vol 86, Num 5, pp 263-269, issn 0020-0190, 7 p.Article

The globally bi-3* and hyper bi-3* connectedness of the spider web networksKAO, Shin-Shin; HSU, Lih-Hsing.Applied mathematics and computation. 2005, Vol 170, Num 1, pp 597-610, issn 0096-3003, 14 p.Article

Mutually independent hamiltonian cycles of binary wrapped butterfly graphsKUENG, Tz-Liang; LIANG, Tyne; HSU, Lih-Hsing et al.Mathematical and computer modelling. 2008, Vol 48, Num 11-12, pp 1814-1825, issn 0895-7177, 12 p.Article

Edge-bipancyclicity of conditional faulty hypercubesSHIH, Lun-Min; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Information processing letters. 2007, Vol 105, Num 1, pp 20-25, issn 0020-0190, 6 p.Article

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positionsCHEN, Hon-Chan; KUNG, Tzu-Liang; HSU, Lih-Hsing et al.Applied mathematics and computation. 2011, Vol 217, Num 24, pp 10058-10065, issn 0096-3003, 8 p.Article

Mutually independent bipanconnected property of hypercubeSHIH, Yuan-Kang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Applied mathematics and computation. 2010, Vol 217, Num 8, pp 4017-4023, issn 0096-3003, 7 p.Article

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubesYANG, Ming-Chien; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Journal of parallel and distributed computing (Print). 2007, Vol 67, Num 4, pp 362-368, issn 0743-7315, 7 p.Article

Panpositionable hamiltonicity of the alternating group graphsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Networks (New York, NY). 2007, Vol 50, Num 2, pp 146-156, issn 0028-3045, 11 p.Article

A note on edge fault tolerance with respect to hypercubesHO, Tung-Yang; SUNG, Ting-Yi; HSU, Lih-Hsing et al.Applied mathematics letters. 2005, Vol 18, Num 10, pp 1125-1128, issn 0893-9659, 4 p.Article

The super connectivity of the pancake graphs and the super laceability of the star graphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, Lih-Hsing et al.Theoretical computer science. 2005, Vol 339, Num 2-3, pp 257-271, issn 0304-3975, 15 p.Article

The super-connected property of recursive circulant graphsTSAI, Chang-Hsiung; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Information processing letters. 2004, Vol 91, Num 6, pp 293-298, issn 0020-0190, 6 p.Article

Panpositionable hamiltonicity and panconnectivity of the arrangement graphsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Applied mathematics and computation. 2008, Vol 198, Num 1, pp 414-432, issn 0096-3003, 19 p.Article

On the spanning connectivity of graphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, Lih-Hsing et al.Discrete mathematics. 2007, Vol 307, Num 2, pp 285-289, issn 0012-365X, 5 p.Article

Optimal 1-edge fault-tolerant designs for laddersCHUANG, Yen-Chu; HSU, Lih-Hsing; CHANG, Chung-Haw et al.Information processing letters. 2002, Vol 84, Num 2, pp 87-92, issn 0020-0190Article

Embedding hamiltonian paths in hypercubes with a required vertex in a fixed positionLEE, Chung-Meng; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Information processing letters. 2008, Vol 107, Num 5, pp 171-176, issn 0020-0190, 6 p.Article

Cubic planar hamiltonian graphs of various typesKAO, Shin-Shin; HSU, Kung-Ming; HSU, Lih-Hsing et al.Discrete mathematics. 2006, Vol 306, Num 13, pp 1364-1389, issn 0012-365X, 26 p.Article

A recursively construction scheme for super fault-tolerant hamiltonian graphsCHEN, Y.-Chuang; HSU, Lih-Hsing; TAN, Jimmy J. M et al.Applied mathematics and computation. 2006, Vol 177, Num 2, pp 465-481, issn 0096-3003, 17 p.Article

Globally bi-3*-connected graphsKAO, Shin-Shin; HSU, Hong-Chun; HSU, Lih-Hsing et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 1931-1946, issn 0012-365X, 16 p.Article

On the construction of combined k-fault-tolerant Hamiltonian graphsHUNG, Chun-Nan; HSU, Lih-Hsing; SUNG, Ting-Yi et al.Networks (New York, NY). 2001, Vol 37, Num 3, pp 165-170, issn 0028-3045Article

On the spanning w-wide diameter of the star graphLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. Frank et al.Networks (New York, NY). 2006, Vol 48, Num 4, pp 235-249, issn 0028-3045, 15 p.Article

Cycle embedding in faulty wrapped butterfly graphsTSAI, Chang-Hsiung; TYNE LIANG; HSU, Lih-Hsing et al.Networks (New York, NY). 2003, Vol 42, Num 2, pp 85-96, issn 0028-3045, 12 p.Article

On 4-ordered 3-regular graphsTSAI, Ming; TSAI, Tsung-Han; TAN, Jimmy J. M et al.Mathematical and computer modelling. 2011, Vol 54, Num 5-6, pp 1613-1619, issn 0895-7177, 7 p.Article